#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int reverse(int x){
int i=(1<<7);
int res=0;
while(x){
if(x%2==1){
res+=i;
}
i=i>>1;
x/=2;
}
return res;
}
void master(){
string s;
getline(cin,s);
int n=s.length();
vector<int> v(n);
for(int i=0;i<n;i++){
v[i]=reverse(s[i]);
}
vector<int> res(n);
res[0]=256-reverse(s[0]);
for(int i=1;i<n;i++){
res[i]=v[i-1]-reverse(s[i]);
if(res[i]<0) res[i]+=256;
}
for(int i:res) cout<<i<<endl;
}
int main() {
// your code goes here
ios_base::sync_with_stdio(false);
cin.tie(NULL);
master();
return 0;
}
MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |